Grokking Tree Coding Patterns for Interviews
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Course Overview
Basics of Tree
Introduction to Tree
Types of Tree
BST Traversal Techniques
BST Operations
Level Order Traversal Pattern (easy)
Introduction to Level Order Traversal Pattern
Reverse Level Order Traversal (easy)
Solution: Reverse Level Order Traversal
Find Largest Value in Each Tree Row (medium)
Solution: Find Largest Value in Each Tree Row
Maximum Width of Binary Tree (medium)
Solution: Maximum Width of Binary Tree
Maximum Level Sum of a Binary Tree (medium)
Solution: Maximum Level Sum of a Binary Tree
Zigzag Traversal (medium)
Solution: Zigzag Traversal
Even Odd Tree (medium)
Solution: Even Odd Tree
N-ary Tree Level Order Traversal (hard)
Solution: N-ary Tree Level Order Traversal
Tree Depth Pattern (easy)
Introduction to Tree Depth Pattern
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Minimum Depth of a Binary Tree (easy)
Solution: Minimum Depth of a Binary Tree
Balanced Binary Tree (easy)
Solution: Balanced Binary Tree
Tree Diameter (easy)
Solution: Tree Diameter
Maximum Depth of N-ary Tree (easy)
Solution: Maximum Depth of N-ary Tree
Find maximum depth of subtree (medium)
Solution: Find maximum depth of subtree
Introduction to Root to Leaf Path Pattern
Binary Tree Paths (easy)
Solution: Binary Tree Paths
Sum of Root To Leaf Binary Numbers (easy)
Solution: Sum of Root To Leaf Binary Numbers
Insufficient Nodes in Root to Leaf Paths (medium)
Solution: Insufficient Nodes in Root to Leaf Paths
Smallest String Starting From Leaf (medium)
Solution: Smallest String Starting From Leaf
Pseudo-Palindromic Paths in a Binary Tree (medium)
Solution: Pseudo-Palindromic Paths in a Binary Tree
All Paths for a Sum (medium)
Solution: All Paths for a Sum
Sum of Path Numbers (medium)
Solution: Sum of Path Numbers
Path With Given Sequence (medium)
Solution: Path With Given Sequence
Count Paths for a Sum (medium)
Solution: Count Paths for a Sum
Introduction to Leaf Processing Pattern
Sum of Left Leaves (easy)
Solution: Sum of Left Leaves
Leaf-Similar Trees (easy)
Solution: Leaf-Similar Trees
Check if all leaves are at same level (medium)
Solution: Check if all leaves are at same level
Delete Leaves With a Given Value (medium)
Solution: Delete Leaves With a Given Value
Deepest Leaves Sum (medium)
Solution: Deepest Leaves Sum
Introduction to Tree View Pattern
Right View of a Binary Tree (medium)
Solution: Right View of a Binary Tree
Top View Of the Binary Tree (medium)
Solution: Top View Of the Binary Tree
Bottom View Of the Binary Tree (medium)
Solution: Bottom View Of the Binary Tree
Boundary of Binary Tree (medium)
Solution: Boundary of Binary Tree
Introduction to Comparison of Two Trees Pattern
Symmetric Tree (easy)
Solution: Symmetric Tree
Mirror Image Trees (medium)
Solution: Mirror Image Trees
Subtree of Another Tree (easy)
Solution: Subtree of Another Tree
Isomorphic Trees (medium)
Solution: Isomorphic Trees
Introduction to Serialize and Deserialize Tree Pattern
Serialize and Deserialize BST (medium)
Solution: Serialize and Deserialize BST
Verify Preorder Serialization of a Binary Tree (medium)
Solution: Verify Preorder Serialization of a Binary Tree
Create Binary Tree From Descriptions (medium)
Solution: Create Binary Tree From Descriptions
Serialize and Deserialize N-ary Tree (hard)
Solution: Serialize and Deserialize N-ary Tree
Solution: Balanced Binary Tree

Problem Statement

Determine if a binary tree is height-balanced.

A binary tree is considered height-balanced if, for each node, the difference in height between its left and right subtrees is no more than one.

Examples:

  1. Input:
    3
   / \
  9  20
     / \
    15  7
  • Expected Output: true
  • Justification: Every node in the tree has a left and right subtree depth difference of either 0 or 1.
  1. Input:
        1
      /   \
     2     2
    / \   / \
   3   3 3   3
  / \       / \
 4   4     4   4
  • Expected Output: true
  • Justification: Each node in the tree has a left and right subtree depth difference of either 0 or 1.
  1. Input:
       1
      / \
     2   5
    /
   3 
  /
 4 
  • Expected Output: false
  • Justification: The root node has a left subtree depth of 3 and right subtree depth of 1. The difference (3 - 1 = 2) exceeds 1, hence the tree is not balanced.

Constraints:

  • The number of nodes in the tree is in the range [0, 5000].
  • -104 <= Node.val <= 104

Solution

To check if a binary tree is balanced, an efficient approach involves a depth-first traversal of the tree. Starting from the root, recursively compute the height of both the left and right subtrees. If at any node, the height difference between its left and right subtree exceeds one, the tree is imbalanced. Otherwise, proceed to check its child nodes. The height of a node is the maximum height of its left or right subtree plus one. This way, we can efficiently traverse each node once and check the height difference of the left and right subtree.

  1. Base Case: If the node is null, return a depth of 0.
  2. Recursive Case: Recursively calculate the depth of the left and right subtrees. If the difference in these depths exceeds 1, or if any recursive call indicates the tree is unbalanced, mark the tree as unbalanced.
  3. Return the depth of the current subtree (1 plus the maximum of the depths of the left and right subtrees).

One key observation is that if any subtree is unbalanced, the entire tree is unbalanced. Thus, if at any step we discover an unbalanced subtree, we can stop our check and return false.

Algorithm Walkthrough:

For the tree:

       1
      / \
     2   5
    /
   3 
  /
 4 
  1. Starting at the root node, which is 1:

    • We'll evaluate both the left and right subtrees.
  2. For its left child (2):

    • We'll examine both its left and right subtrees.
  3. For the left child's left child (3):

    • It has a left child, 4, with no further descendants. The maximum depth from this node is 1.
    • It doesn't have a right child, so its depth is 0.
    • Difference in depths for node 3: 1 - 0 = 1 (This is within the allowable range of ≤ 1).
  4. The left child (2) of the root doesn't have a right child. Thus, its depth is 0.

  5. For the root's left child (2):

    • The maximum depth for its left subtree (from node 3 to 4) is 2.
    • It doesn't have a right subtree, so its depth is 0.
    • Difference in depths for node 2: 2 - 0 = 2 (This difference is greater than 1, signifying that this subtree is unbalanced).
  6. For the root's right child (5):

    • It doesn't have a left child or a right child, which means both depths are 0.
  7. Comparing both children of the root node (1):

    • The left subtree has a maximum depth of 3.
    • The right subtree has a depth of 1.
    • Difference in depths for node 1: 3 - 1 = 2 (This exceeds the threshold of 1).
  8. Considering the findings from steps 5 and 7, the algorithm determines that the tree is not balanced.

Here is the visual representation of the algorithm:

Balanced Binary Tree
Balanced Binary Tree

Code

Here is the code for this algorithm:

Java
Saved to Cloud

. . . .

Complexity Analysis

Time Complexity: O(n), where n is the number of nodes in the tree. Each node is visited once.

Space Complexity: O(h), where h is the height of the tree. This accounts for the maximum depth of the recursive call stack.

Balanced Binary Tree (easy)
Tree Diameter (easy)
Mark as Completed

On this page

Problem Statement

Solution

Code

Complexity Analysis